Concurrency : Mutual Exclusion and Synchronization - Part
نویسنده
چکیده
منابع مشابه
Using Generating Functions to Compute Concurrency
We present succinctly the Arnold-Nivat's model for the synchronization of sequential preocesses, and we recall the concurrency measure defined by Beauquier, Dérard and Thimonier. We present here a new technics for the computation of this measure avoiding very often a very expensive part of the computation. We illustrate this method by the mutual exclusion example.
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملConcepts for Concurrent Programming
Techniques for reasoning about safety properties of concurrent program~ are discussed and implications for program design noted. The relationship between interference freedom and synchronization mechanisms is described. The methods are illustrated with a number of examples, including partial correctness of a bank simulation, and mutual exclusion, non-blocking, and deadlock freedom of a solution...
متن کاملA Comparison of the Concurrency and Real-Time Features of Ada 95 and Java
1. ABSTRACT Both Ada and Java support concurrent programming, but through quite different approaches. Ada has built-in tasking features with concurrency semantics, independent of the language’s OOP model, whereas Java’s thread support relies on OOP and is based on special execution properties of methods in several predefined classes. Ada achieves mutual exclusion through protected objects with ...
متن کاملA Fair Distributed Mutual Exclusion Algorithm
ÐThis paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N ÿ 1 and 2 N ÿ 1 messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003